A Set and Collection Lemma
نویسندگان
چکیده
منابع مشابه
A Set and Collection Lemma
A set S ⊆ V (G) is independent if no two vertices from S are adjacent. Let α (G) stand for the cardinality of a largest independent set. In this paper we prove that if Λ is a nonempty collection of maximum independent sets of a graph G, and S is an independent set, then • there is a matching from S − ⋂ Λ into ⋃ Λ− S, and • |S|+ α(G) 6 ∣∣∣⋂Λ ∩ S∣∣∣+ ∣∣∣⋃Λ ∪ S∣∣∣. Based on these findings we provi...
متن کاملThe Rokhlin lemma for homeomorphisms of a Cantor set
For a Cantor set X, let Homeo(X) denote the group of all homeo-morphisms of X. The main result of this note is the following theorem. Several corollaries of this result are given. In particular, it is proved that for any aperiodic T ∈ Homeo(X) the set of all homeomorphisms conjugate to T is dense in the set of aperiodic homeomorphisms. 0. Introduction. One of the most useful results in ergodic ...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملA RELATION BETWEEN THE CATEGORIES Set * , SetT, Set AND SetT
In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.
متن کاملLEMMA: A Distributed Shared Memory with Global and Local Garbage Collection
Standard ML is an established programming language with a well-understood semantics. Several projects have enriched the language with primitives or constructions for concurrency, among them Poly/ML and LCS. We describe rst the previous run-time systems for Poly/ML and LCS and then the development of a new memory management system, LEMMA, which allows parallel programs to be run on networks of w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/2514